By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 21, Issue 4, pp. 601-799

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions

Elefterios A. Melissaratos and Diane L. Souvaine

pp. 601-638

BibTeX  Abstract Full Text:  PDF

Dynamic Tree Embeddings in Butterflies and Hypercubes

F. T. Leighton, Mark J. Newman, Abhiram G. Ranade, and Eric J. Schwabe

pp. 639-654

BibTeX  Abstract Full Text:  PDF

Circuit Definitions of Nondeterministic Complexity Classes

H. Venkateswaran

pp. 655-670

BibTeX  Abstract Full Text:  PDF

An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra

Bernard Chazelle

pp. 671-696

BibTeX  Abstract Full Text:  PDF

The Power of the Queue

Ming Li, Luc Longpré, and Paul Vitányi

pp. 697-712

BibTeX  Abstract Full Text:  PDF

Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited

David Aldous, Micha Hofri, and Wojciech Szpankowski

pp. 713-732

BibTeX  Abstract Full Text:  PDF

Complete Problems and Strong Polynomial Reducibilities

K. Ganesan and Steven Homer

pp. 733-742

BibTeX  Abstract Full Text:  PDF

On the Structure of Bounded Queries to Arbitrary NP Sets

Richard Chang

pp. 743-754

BibTeX  Abstract Full Text:  PDF

An Optimal Parallel Algorithm for Formula Evaluation

S. Buss, S. Cook, A. Gupta, and V. Ramachandran

pp. 755-780

BibTeX  Abstract Full Text:  PDF

On the Complexity of Polynomial Zeros

Dario Bini and Luca Gemignani

pp. 781-799

BibTeX  Abstract Full Text:  PDF